ScottKnott: A Package for Performing the Scott-Knott Clustering Algorithm in R
نویسندگان
چکیده
منابع مشابه
optCluster: An R Package for Determining the Optimal Clustering Algorithm
There exist numerous programs and packages that perform validation for a given clustering solution; however, clustering algorithms fare differently as judged by different validation measures. If more than one performance measure is used to evaluate multiple clustering partitions, an optimal result is often difficult to determine by visual inspection alone. This paper introduces optCluster, an R...
متن کاملEffort Estimation Using Scott Knott Test
Software Cost Estimation is used for large-scaled and complex software systems leads managers to settle SCE as one of the most vital activities that is closely related to predicate the success or failure of the whole development process. Propose a statistical framework based on a multiple comparisons algorithm in order to rank several cost estimation models, identifying those which have signifi...
متن کاملAdjusting the Scott-Knott cluster analyses for unbalanced designs
The Scott-Knott cluster analysis is an alternative approach to mean comparisons with high power and no subset overlapping. It is well suited for the statistical challenges in agronomy associated with testing new cultivars, crop treatments, or methods. The original Scott-Knott test was developed to be used under balanced designs; therefore, the loss of a single plot can significantly increase th...
متن کاملThe lifecontingencies Package: A Package for Performing Financial and Actuarial Mathematics Calculations in R
It is possible to model life contingency insurances with the lifecontingencies R package, which is capable of performing financial and actuarial mathematics calculations. Its functions permit one to determine both the expected value and the stochastic distribution of insured benefits. Therefore, life insurance coverage can be priced and portfolios risk-based capital requirements can be assessed...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TEMA (São Carlos)
سال: 2014
ISSN: 2179-8451,1677-1966
DOI: 10.5540/tema.2014.015.01.0003